Consensus-ADMM for General Quadratically Constrained Quadratic Programming
نویسندگان
چکیده
منابع مشابه
On convex relaxations for quadratically constrained quadratic programming
We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let F denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on F is dominated by an alternative methodology based ...
متن کاملOn Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian Relaxation and the semi...
متن کاملOn the Sequential Quadratically Constrained Quadratic Programming Methods
An iteration of the sequential quadratically constrained quadratic programming method (SQCQP) consists of minimizing a quadratic approximation of the objective function subject to quadratic approximation of the constraints, followed by a linesearch in the obtained direction. Methods of this class are receiving attention due to the development of efficient interior point techniques for solving s...
متن کاملHidden convexity in some nonconvex quadratically constrained quadratic programming
We consider the problem of minimizing an indefinite quadratic objective function subject to twosided indelinite quadratic constraints. Under a suitable simultaneous diagonalization assumption {which trivially holds for trust region type problems), we prove that the original problem is equivalent to a convex minimization problem with simple linear constraints. We then consider a special problem ...
متن کاملLinear Programming Relaxations of Quadratically Constrained Quadratic Programs
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD cuts. Computational results based on instances from the literature are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2593681